Laplacian energy of trees with at most 10 vertices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES

Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...

متن کامل

On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices

Copyright q 2012 X. Pai and S. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Let Φ G, λ det λIn − L G ∑n k 0 −1 ck G λn−k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we g...

متن کامل

cospectrality measures of graphs with at most six vertices

cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...

متن کامل

Splitting trees at vertices

We present tight bounds on splitting trees into “small” subtrees.

متن کامل

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Combinatorics

سال: 2018

ISSN: 2541-2205

DOI: 10.19184/ijc.2018.2.1.3